A Finite Algorithm to Compute Rank-1 Tensor Approximations
نویسندگان
چکیده
منابع مشابه
A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms
Abstract. We propose a novel and constructive algorithm that decomposes an arbitrary tensor into a finite sum of orthonormal rank-1 outer factors. The algorithm, named TTr1SVD, works by converting the tensor into a rank-1 tensor train (TT) series via singular value decomposition (SVD). TTr1SVD naturally generalizes the SVD to the tensor regime and delivers elegant notions of tensor rank and err...
متن کاملTensor Regression Networks with various Low-Rank Tensor Approximations
Tensor regression networks achieve high rate of compression of model parameters in multilayer perceptrons (MLP) while having slight impact on performances. Tensor regression layer imposes low-rank constraints on the tensor regression layer which replaces the flattening operation of traditional MLP. We investigate tensor regression networks using various low-rank tensor approximations, aiming to...
متن کاملEfficient Algorithm for Minimal-Rank Matrix Approximations
For a given matrix H which has d singular values larger than ε, an expression for all rank-d approximants Ĥ such that (H− Ĥ) has 2-norm less than ε is derived. These approximants have minimal rank, and the set includes the usual ‘truncated SVD’ low-rank approximation. The main step in the procedure is a generalized Schur algorithm, which requires only O(1/2 m 2n) operations (for an m × n matrix...
متن کاملThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor∗
The ability to approximate a multivariate function/tensor as a sum of separable functions/tensors is quite useful. Unfortunately, algorithms to do so are not robust and regularly exhibit unpleasantly interesting behavior. A variety of different algorithms have been proposed with different features, but the state of the art is still unsatisfactory. In this work we step back from the algorithms a...
متن کاملAn Algorithm to Compute
The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2016
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2016.2570862